Trace optimization problems and generalized geometric programming
نویسندگان
چکیده
منابع مشابه
Global optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملGlobal Optimization in Generalized Geometric Programming
A deterministic global optimization algorithm is proposed for locating the global minimum of generalized geometric (signomial) problems (GGP). By utilizing an exponential variable transformation the initial nonconvex problem (GGP) is reduced to a (DC) programming problem where both the constraints and the objective are decomposed into the diierence of two convex functions. A convex relaxation o...
متن کاملA New Global Optimization Algorithm for Solving Generalized Geometric Programming
A global optimization algorithm for solving generalized geometric programming GGP problem is developed based on a new linearization technique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away a large part of the current investigated region in which the global optimal solution does not exist. Convergence ...
متن کاملSolving Geometric Optimization Problems
We show how to use graphics hardware for tackling optimization problems arising in the field of computational geometry. We exemplarily discuss three problems, where combinatorial algorithms are inefficient or hard to implement. Given a set S of n point in the plane, the first two problems are to determine the smallest homothetic scaling of a star shaped polygon P enclosing S and to find the lar...
متن کاملTwo Geometric Optimization Problems
We consider two optimization problems with geometric structures The rst one con cerns the following minimization problem termed as the rectilinear polygon cover problem Cover certain features of a given rectilinear polygon possibly with rectilinear holes with the minimum number of rectangles included in the polygon Depending upon whether one wants to cover the interior boundary or corners of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1977
ISSN: 0022-247X
DOI: 10.1016/0022-247x(77)90214-1